Trends in Topological Combinatorics
نویسنده
چکیده
I was the shadow of the waxwing slain By the false azure in the windowpane; I was the smudge of ashen fluff-and I Lived on, flew on, in the reflected sky. PREFACE This thesis is thought to be reflective of the transformation, mistily rendered in the citation on the previous page, which has taken place in me since I have handed in my Ph.D. thesis in the spring of 1996. If this transformation, not unnatural taking into account that I was 23 at the time, was to the better or to the worse, I leave for the reader to judge. Now, before indulging into mathematics, I would like to thank my coauthors Eva-Maria Feichtner and Eric Babson, without whom the second, resp. the fifth, chapters would not exist.
منابع مشابه
The topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملRelationships between Randic index and other topological indices
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d_u$ denote the degree of vertex $u$ in $G$. The Randi'c index of $G$ is defined as${R}(G) =sum_{uvin E(G)} 1/sqrt{d_ud_v}.$In this paper, we investigate the relationships between Randi'cindex and several topological indices.
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملعدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کامل25 years proof of the Kneser conjecture The advent of topological combinatorics
With this article I want to take the opportunity to sketch the development of topological proofs in discrete mathematics beginning with the proof of the Kneser conjecture about 25 years ago, which eventually led to a new discipline: topological combinatorics. In the beginning of the twentieth century the discipline of combinatorial topology already made use of combinatorial concepts in topology...
متن کاملThe Borsuk-Ulam-property, Tucker-property and constructive proofs in combinatorics
This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group G is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001